Toggle Equivalence Preserving Logic Synthesis

نویسنده

  • Eugene Goldberg
چکیده

Earlier, a theory was introduced that enabled a method of scalable logic synthesis. In this method, given a circuit N1 and its partition into subcircuits N1 , i=1,..k, an optimized circuit N2 functionally equivalent to N1 is built by replacing each subcircuit N1 i with a toggle equivalent counterpart N2 . To implement this method in practice, one needs a procedure that, given a multi-output subcircuit N1 , builds another multi-output subcircuit N2 i that is toggle equivalent to N1 . In this report, we introduce such a procedure and test it on MCNC benchmarks. Experiments show great potential of the new method of logic synthesis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logic synthesis preserving high-level specification

In this paper we develop a method of logic synthesis that preserves high-level structure of the circuit to be synthesized. This method is based on the fact that two combinational circuits implementing the same “high-level” specification can be efficiently checked for equivalence. Hence, logic transformations preserving a predefined specification can be made efficiently. We introduce the notion ...

متن کامل

Escaping Local Minima in Logic Synthesis

In this report, we continue studying Logic Synthesis Preserving Specification (LSPS). Given a combinational circuit N and its partition into subcircuits N1,..,Nk (this partition is called a specification of N), LSPS optimizes N by replacing each subcircuit Ni with toggle equivalent subcircuit Ni. As we showed before, LSPS is scalable. In this report, we demonstrate that LSPS can be also viewed ...

متن کامل

Logic Frameworks for Logic Programs

We show how logical frameworks can provide a basis for logic program synthesis. With them, we may use first-order logic as a foundation to formalize and derive rules that constitute program development calculi. Derived rules may be in turn applied to synthesize logic programs using higher-order resolution during proof that programs meet their specifications. We illustrate this using Paulson’s I...

متن کامل

An Equivalence Based Method for Compositional Verification of the Linear Temporal Logic of Constraint Automata

Constraint automaton is a formalism to capture the operational semantics of the channel based coordination language Reo. In general constraint automaton can be used as a formalism for modeling coordination of some components. In this paper we introduce a standard linear temporal logic and two fragments of it for expressing the properties of the systems modeled by constraint automata and show th...

متن کامل

Modular Minimization of Deterministic Finite State Machines

This work presents a modular technique for minimizing a deterministic nite state ma chine FSM while preserving its equivalence to the original system Being modular the minimization technique should consume less time and space Preserving equivalence the resulting minimized model can be employed in both temporal logic model checking and sequential equivalence checking thus reducing their time and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005